Stochastic dynamic models and Chebyshev splines

Variable degree polynomial splines are Chebyshev splines

Variable degree polynomial (VDP) splines have recently proved themselves as a valuable tool in obtaining shape preserving approximations. However, some usual properties which one would expect of a spline space in order to be useful in geometric modeling, do not follow easily from their definition. This includes total positivity (TP) and variation diminishing, but also constructive algorithms ba...

Identifiability of Dynamic Stochastic General Equilibrium Models with Covariance Restrictions

This article is concerned with identification problem of parameters of Dynamic Stochastic General Equilibrium Models with emphasis on structural constraints, so that the number of observable variables is equal to the number of exogenous variables. We derived a set of identifiability conditions and suggested a procedure for a thorough analysis of identification at each point in the parameters sp...

On Construction of Fourth Order Chebyshev Splines

It is an important fact that general families of Chebyshev and L-splines can be locally represented, i.e. there exists a basis of B-splines which spans the entire space. We develop a special technique to calculate with 4 order Chebyshev splines of minimum deficiency on nonuniform meshes, which leads to a numerically stable algorithm, at least in case one special Hermite interpolant can be const...

Dynamic Inventory Models and Stochastic Programming

A wide class of single-product, dynamic inventory problems with convex cost functions and a finite horizon is investigated as a stochastic programming problem. When demands have finite discrete distribution functions, we show that the problem can be substantially reduced in size to a linear program with upper-bounded variables. Moreover,, we show that the reduced problem has a network represent...

Tina Bosner Knot insertion algorithms for Chebyshev splines